منابع مشابه
König ’ s Theorem
The articles [11], [7], [14], [13], [15], [5], [6], [2], [12], [1], [10], [8], [9], [3], and [4] provide the notation and terminology for this paper. For simplicity, we adopt the following rules: A, B denote ordinal numbers, K, M, N denote cardinal numbers, x, y, z, X , Y , Z, Z1, Z2 denote sets, n denotes a natural number, and f , g denote functions. Let I1 be a function. We say that I1 is car...
متن کاملDer König ist tot! Es lebe der König?
Zeitgleich fand das Schießen auf die von Renate und Edgar Nickel gestiftete Jubiläumsscheibe (Goldenen Hochzeit), inclusive vier zugehöriger Preise, auf dem 25m-Stand statt. Jeder Vereinsschütze durfte nach Bezahlung der Einlage einen Schuss mit dem Kleinkalibergewehr, stehend freihändig, abgeben. Erstaunlicherweise erzielte von den 27 angetretenen Schützen ein Mitglied der Bogenabteilung den b...
متن کاملKönig ’ s Lemma
A contiuation of [5]. The notions of finite-order trees, succesors of an element of a tree, and chains, levels and branches of a tree are introduced. Those notions are used to formalize König’s Lemma which claims that there is a infinite branch of a finite-order tree if the tree has arbitrary long finite chains. Besides, the concept of decorated trees is introduced and some concepts dealing wit...
متن کاملForbidden subgraphs and the König-Egerváry property
The matching number of a graph is the maximum size of a set of vertexdisjoint edges. The transversal number is the minimum number of vertices needed to meet every edge. A graph has the König-Egerváry property if its matching number equals its transversal number. Lovász proved a characterization of graphs having the König-Egerváry property by means of forbidden subgraphs within graphs with a per...
متن کاملPq-König Extended Forests and Cycles
A graph is König for a q-path if every its induced subgraph has the following property. The maximum number of pairwise vertex-disjoint induced paths each on q vertices is equal to the minimum number of vertices, such that removing all the vertices produces a graph having no an induced path on q vertices. In this paper, for every q ≥ 5, we describe all König graphs for a qpath obtained from fore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philologus
سال: 1867
ISSN: 2196-7008,0031-7985
DOI: 10.1524/phil.1867.26.14.369